The complete mixability and convex minimization problems with monotone marginal densities

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The complete mixability and convex minimization problems with monotone marginal densities

Following the results in Rüschendorf and Uckelmann (2002), we introduce the completely mixable distributions on R and prove that distributions with monotone density and moderate mean are completely mixable. Using this method we solve the minimization problem minXi∼P Ef(X1 + · · ·+ Xn) for convex functions f and marginal distributions P with monotone density. Our results also provide valuable im...

متن کامل

Advances in Complete Mixability

The concept of complete mixability is relevant to some problems of optimal couplings with important applications in quantitative risk management. In this paper, we prove new properties of the set of completely mixable distributions, including a completeness and a decomposition theorem. We also show that distributions with a concave density and radially symmetric distributions are completely mix...

متن کامل

Convex minimization problems with weak constraint qualifications

One revisits the standard saddle-point method based on conjugate duality for solving convex minimization problems. Our aim is to reduce or remove unnecessary topological restrictions on the constraint set. Dual equalities and characterizations of the minimizers are obtained with weak or without constraint qualifications. The main idea is to work with intrinsic topologies which reflect some geom...

متن کامل

Complete Problems for Monotone NP

We show that the problem of deciding whether a digraph has a Hamiltonian path between two specified vertices and the problem of deciding whether a given graph has a cubic subgraph are complete for monotone NP via monotone projection translations. We also show that the problem of deciding whether a uniquely partially orderable (resp. comparability) graph has a cubic subgraph is complete for NP v...

متن کامل

Bounds for the sum of dependent risks and worst Value-at-Risk with monotone marginal densities

In quantitative risk management, it is important and challenging to find sharp bounds for the distribution of the sum of dependent risks with given marginal distributions, but an unspecified dependence structure. These bounds are directly related to the problem of obtaining the worst Value-at-Risk of the total risk. Using the idea of the complete mixability, we provide a new lower bound for any...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Multivariate Analysis

سال: 2011

ISSN: 0047-259X

DOI: 10.1016/j.jmva.2011.05.002